Fair Scheduling for the Optimal Link of Ad hoc Network Based on Graph Theory
نویسندگان
چکیده
منابع مشابه
QoS-Aware Fair Scheduling in Wireless Ad Hoc Networks with Link Errors
To provide scheduling in wireless ad hoc networks, that is both highly efficient and fair in resource allocation, is not a trivial task because of the unique problems in wireless networks such as location dependent and bursty errors in wireless link. A packet flow in such a network may be unsuccessful if it experiences errors. This may lead to situations in which a flow receives significantly l...
متن کاملFair Scheduling with QoS Support in Ad Hoc Networks
This paper studies fair scheduling with Quality of Service (QoS) support in ad hoc networks. The goal is to satisfy the minimum bandwidth requirements of guaranteed flows and to provide fair share of residual bandwidth among all flows. We propose a new cluster-based mechanism called two-tier slot allocation protocol (2TSAP), which improves system throughput and ensures per-cluster fairness whil...
متن کاملFair scheduling with bottleneck consideration in wireless ad-hoc networks
networks attempts to balance the trade-off between fairness and channel utilization. In this paper, we first propose a topology-independent methodology to predict maximum achievable channel utilization under fairness constraint by two performance bounds. Based on the notion of bottlenecks introduced in prediction, we design a centralized and improved fair scheduling algorithm for wireless ad-ho...
متن کاملapplication of upfc based on svpwm for power quality improvement
در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...
15 صفحه اولFlow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc networks due to infrastructure free operation and location dependent contentions. As there is no entity to serve coordination among nodes, we need a mechanism to overcome inherent unreliability of the network to provid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2011
ISSN: 1812-5638
DOI: 10.3923/itj.2011.2084.2090